________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:15:09
Input Data from:  dataset107.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,065
Average f[i]   :3800
Average g[i,j] :1895,2380952381
Total demand   :5220
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	1290	1	-1	4	6500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0    >new incumb.: 1290


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 33
> Selected Move:	1570	1	-1	5	12500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0    >new incumb.: 1570


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	1840	1	-1	9	17000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1    >new incumb.: 1840


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 33
> Selected Move:	1810	3	1	3	19300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 19
> Selected Move:	1830	3	4	6	17300


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 23
> Selected Move:	1830	4	3	5	15500


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 22
> Selected Move:	1830	4	5	6	17100


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 22
> Selected Move:	1830	4	6	9	17400


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 22
> Selected Move:	1830	3	5	4	17900


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 25
> Selected Move:	1860	3	9	8	18400


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  0    >new incumb.: 1860


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 20
> Selected Move:	1860	4	8	3	19300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 16
> Selected Move:	1860	4	3	4	17700


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 20
> Selected Move:	1860	4	4	6	19100


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 21
> Selected Move:	1830	3	8	5	19100


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 21
> Selected Move:	1830	4	6	3	19300


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 18
> Selected Move:	1830	4	3	4	17700


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 22
> Selected Move:	1830	4	4	5	17500


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 22
> Selected Move:	1830	3	0	8	19800


> New Y[]: 
	
	 0  0  4  1  1  3  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 9
> Selected Move:	1830	4	5	4	20000


> New Y[]: 
	
	 0  0  4  1  3  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 9
> Selected Move:	1830	4	4	8	19900


> New Y[]: 
	
	 0  0  4  1  2  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 10
> Selected Move:	1830	4	4	5	19900


> New Y[]: 
	
	 0  0  4  1  1  2  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 8
> Selected Move:	1830	4	8	4	19200


> New Y[]: 
	
	 0  0  4  1  3  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 9
> Selected Move:	1830	4	4	5	19000


> New Y[]: 
	
	 0  0  4  1  2  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 11
> Selected Move:	1830	3	5	9	19400


> New Y[]: 
	
	 0  0  4  1  2  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 12
> Selected Move:	1830	4	9	3	19300


> New Y[]: 
	
	 0  0  4  3  2  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 13
> Selected Move:	1830	4	3	4	19500


> New Y[]: 
	
	 0  0  4  2  3  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 11
> Selected Move:	1830	4	3	6	19600


> New Y[]: 
	
	 0  0  4  1  3  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 13
> Selected Move:	1830	4	4	6	19100


> New Y[]: 
	
	 0  0  4  1  2  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 11
> Selected Move:	1830	4	4	8	19900


> New Y[]: 
	
	 0  0  4  1  1  0  3  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 12
> Selected Move:	1830	4	6	4	18500


> New Y[]: 
	
	 0  0  4  1  3  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 14
> Selected Move:	1830	4	4	8	18400


> New Y[]: 
	
	 0  0  4  1  2  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 15
> Selected Move:	1800	3	2	5	19900


> New Y[]: 
	
	 0  0  0  1  2  4  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 9
> Selected Move:	1800	4	4	5	19400


> New Y[]: 
	
	 0  0  0  1  4  2  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 13
> Selected Move:	1800	4	4	8	19500


> New Y[]: 
	
	 0  0  0  1  3  2  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 9
> Selected Move:	1800	4	4	5	19300


> New Y[]: 
	
	 0  0  0  1  2  3  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 7
> Selected Move:	1800	4	4	8	19300


> New Y[]: 
	
	 0  0  0  1  4  3  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 9
> Selected Move:	1820	3	8	0	17000


> New Y[]: 
	
	 2  0  0  1  4  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 19
> Selected Move:	1820	4	4	3	19200


> New Y[]: 
	
	 2  0  0  4  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 17
> Selected Move:	1820	4	3	5	19300


> New Y[]: 
	
	 2  0  0  3  1  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 15
> Selected Move:	1830	3	5	2	17800


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 20
> Selected Move:	1830	4	3	4	16200


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 19
> Selected Move:	1830	4	4	6	17600


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 21
> Selected Move:	1820	3	2	5	19100


> New Y[]: 
	
	 2  0  0  1  1  4  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 17
> Selected Move:	1820	4	5	4	18600


> New Y[]: 
	
	 2  0  0  1  4  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 17
> Selected Move:	1820	4	4	6	19400


> New Y[]: 
	
	 2  0  0  1  3  1  4  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 16
> Selected Move:	1820	4	4	5	19200


> New Y[]: 
	
	 2  0  0  1  1  3  4  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 14
> Selected Move:	1820	4	6	9	19500


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 12
> Selected Move:	1820	4	5	4	19700


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 14
> Selected Move:	1820	4	4	9	18900


> New Y[]: 
	
	 2  0  0  1  4  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 15
> Selected Move:	1820	4	4	5	19400


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 12
> Selected Move:	1820	4	9	4	17700


> New Y[]: 
	
	 2  0  0  1  3  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 13
> Selected Move:	1820	4	5	3	19400


> New Y[]: 
	
	 2  0  0  4  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 13
> Selected Move:	1820	4	3	4	18800


> New Y[]: 
	
	 2  0  0  3  4  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 19
> Selected Move:	1760	3	3	1	16500


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 25
> Selected Move:	1770	3	4	2	15000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 33
> Selected Move:	1830	1	-1	3	20000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 25
> Selected Move:	1745	3	3	7	20500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 25
> Selected Move:	1685	3	7	8	21000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 17
> Selected Move:	1740	4	0	5	16500


> New Y[]: 
	
	 0  3  4  0  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 18
> Selected Move:	1800	3	1	3	18800


> New Y[]: 
	
	 0  0  4  3  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 18
> Selected Move:	1800	4	3	5	18800


> New Y[]: 
	
	 0  0  4  2  0  3  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 17
> Selected Move:	1800	4	3	6	18900


> New Y[]: 
	
	 0  0  4  1  0  3  2  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 18
> Selected Move:	1800	4	5	6	18600


> New Y[]: 
	
	 0  0  4  1  0  2  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 16
> Selected Move:	1800	4	5	8	19400


> New Y[]: 
	
	 0  0  4  1  0  1  3  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 16
> Selected Move:	1800	4	6	3	19600


> New Y[]: 
	
	 0  0  4  3  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 14
> Selected Move:	1810	3	5	4	20100


> New Y[]: 
	
	 0  0  4  3  1  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 11
> Selected Move:	1790	4	3	8	20200


> New Y[]: 
	
	 0  0  4  2  1  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 13
> Selected Move:	1800	3	4	5	19700


> New Y[]: 
	
	 0  0  4  2  0  1  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 13
> Selected Move:	1800	4	3	5	17900


> New Y[]: 
	
	 0  0  4  1  0  2  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 69 #######################


> Neighbours evaluated; 15
> Selected Move:	1800	4	5	6	19800


> New Y[]: 
	
	 0  0  4  1  0  1  2  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 70 #######################


> Neighbours evaluated; 14
> Selected Move:	1790	3	6	4	19900


> New Y[]: 
	
	 0  0  4  1  2  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 71 #######################


> Neighbours evaluated; 16
> Selected Move:	1790	4	4	5	19900


> New Y[]: 
	
	 0  0  4  1  1  2  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 72 #######################


> Neighbours evaluated; 16
> Selected Move:	1790	4	5	8	19800


> New Y[]: 
	
	 0  0  4  1  1  3  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 73 #######################


> Neighbours evaluated; 15
> Selected Move:	1810	3	8	0	17500


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 74 #######################


> Neighbours evaluated; 21
> Selected Move:	1810	4	5	4	17700


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 75 #######################


> Neighbours evaluated; 21
> Selected Move:	1810	4	4	9	19400


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 76 #######################


> Neighbours evaluated; 23
> Selected Move:	1750	3	9	8	19900


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 77 #######################


> Neighbours evaluated; 21
> Selected Move:	1760	3	4	6	17900


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 78 #######################


> Neighbours evaluated; 25
> Selected Move:	1760	4	8	3	18800


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 79 #######################


> Neighbours evaluated; 25
> Selected Move:	1760	4	3	5	17000


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 80 #######################


> Neighbours evaluated; 25
> Selected Move:	1800	3	0	9	19400


> New Y[]: 
	
	 0  0  4  1  0  3  1  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 81 #######################


> Neighbours evaluated; 14
> Selected Move:	1818	3	5	4	20100


> New Y[]: 
	
	 0  0  4  1  3  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,12

## ITERATION 82 #######################


> Neighbours evaluated; 12
> Selected Move:	1734	4	4	8	20800


> New Y[]: 
	
	 0  0  4  1  1  0  1  0  3  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,115

## ITERATION 83 #######################


> Neighbours evaluated; 12
> Selected Move:	1807	4	8	9	20200


> New Y[]: 
	
	 0  0  4  1  1  0  1  0  2  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,11

## ITERATION 84 #######################


> Neighbours evaluated; 12
> Selected Move:	1800	3	4	5	19700


> New Y[]: 
	
	 0  0  4  1  0  1  1  0  2  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 85 #######################


> Neighbours evaluated; 14
> Selected Move:	1800	4	8	5	18900


> New Y[]: 
	
	 0  0  4  1  0  2  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 86 #######################


> Neighbours evaluated; 13
> Selected Move:	1760	3	2	4	20400


> New Y[]: 
	
	 0  0  0  1  4  2  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 87 #######################


> Neighbours evaluated; 16
> Selected Move:	1791	4	9	6	20100


> New Y[]: 
	
	 0  0  0  1  4  2  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 88 #######################


> Neighbours evaluated; 16
> Selected Move:	1770	4	6	3	20300


> New Y[]: 
	
	 0  0  0  3  4  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,105

## ITERATION 89 #######################


> Neighbours evaluated; 12
> Selected Move:	1769	4	3	5	20300


> New Y[]: 
	
	 0  0  0  2  4  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,11

## ITERATION 90 #######################


> Neighbours evaluated; 13
> Selected Move:	1756	4	3	6	20400


> New Y[]: 
	
	 0  0  0  1  4  3  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,115

## ITERATION 91 #######################


> Neighbours evaluated; 14
> Selected Move:	1720	4	4	6	20700


> New Y[]: 
	
	 0  0  0  1  2  3  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,12

## ITERATION 92 #######################


> Neighbours evaluated; 13
> Selected Move:	1790	3	6	2	19000


> New Y[]: 
	
	 0  0  4  1  2  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 93 #######################


> Neighbours evaluated; 17
> Selected Move:	1790	4	4	5	19200


> New Y[]: 
	
	 0  0  4  1  3  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 94 #######################


> Neighbours evaluated; 16
> Selected Move:	1790	4	5	8	20000


> New Y[]: 
	
	 0  0  4  1  3  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 95 #######################


> Neighbours evaluated; 14
> Selected Move:	1720	3	3	6	19500


> New Y[]: 
	
	 0  0  4  0  3  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,14

## ITERATION 96 #######################


> Neighbours evaluated; 16
> Selected Move:	1740	3	4	1	17300


> New Y[]: 
	
	 0  3  4  0  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 97 #######################


> Neighbours evaluated; 14
> Selected Move:	1790	3	6	4	19300


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 98 #######################


> Neighbours evaluated; 16
> Selected Move:	1790	4	8	4	18500


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 99 #######################


> Neighbours evaluated; 21
> Selected Move:	1790	4	4	5	18500


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 100 #######################


> Neighbours evaluated; 20
> Selected Move:	1770	3	5	6	18900


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,125

## ITERATION 101 #######################


> Neighbours evaluated; 17
> Selected Move:	1770	4	6	4	17000


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,12

## ITERATION 102 #######################


> Neighbours evaluated; 16
> Selected Move:	1770	4	4	8	17800


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,115

## ITERATION 103 #######################


> Neighbours evaluated; 14
> Selected Move:	1770	4	8	9	19400


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,11

## ITERATION 104 #######################


> Neighbours evaluated; 19
> Selected Move:	1860	3	9	0	17000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 105 #######################


> Neighbours evaluated; 33
> Selected Move:	1933	1	-1	9	21500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 106 #######################


> Neighbours evaluated; 26
> Selected Move:	1900	3	8	5	21500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 107 #######################


> Neighbours evaluated; 28
> Selected Move:	1855	3	9	8	23000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 108 #######################


> Neighbours evaluated; 24
> Selected Move:	1780	3	5	3	22000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 109 #######################


> Neighbours evaluated; 21
> Selected Move:	1843	3	1	5	23500


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 110 #######################


> Neighbours evaluated; 20
> Selected Move:	1930	3	8	9	22000


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 111 #######################


> Neighbours evaluated; 17
> Selected Move:	1901	4	5	4	22200


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 112 #######################


> Neighbours evaluated; 20
> Selected Move:	1870	3	5	8	22200


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 113 #######################


> Neighbours evaluated; 21
> Selected Move:	1833	3	4	5	21500


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 114 #######################


> Neighbours evaluated; 16
> Selected Move:	1820	3	8	7	21000


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 115 #######################


> Neighbours evaluated; 25
> Selected Move:	1746	4	5	7	21600


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 116 #######################


> Neighbours evaluated; 26
> Selected Move:	1702	3	7	8	22400


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 117 #######################


> Neighbours evaluated; 12
> Selected Move:	1763	4	0	9	20300


> New Y[]: 
	
	 0  0  4  1  0  1  1  0  3  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 118 #######################


> Neighbours evaluated; 12
> Selected Move:	1707	3	8	4	20100


> New Y[]: 
	
	 0  0  4  1  3  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 119 #######################


> Neighbours evaluated; 15
> Selected Move:	1720	4	4	5	19900


> New Y[]: 
	
	 0  0  4  1  1  3  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 120 #######################


> Neighbours evaluated; 15
> Selected Move:	1720	4	5	9	19400


> New Y[]: 
	
	 0  0  4  1  1  2  1  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 121 #######################


> Neighbours evaluated; 13
> Selected Move:	1720	4	5	4	19400


> New Y[]: 
	
	 0  0  4  1  2  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 122 #######################


> Neighbours evaluated; 13
> Selected Move:	1720	4	9	3	19300


> New Y[]: 
	
	 0  0  4  3  2  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 123 #######################


> Neighbours evaluated; 14
> Selected Move:	1720	4	3	4	19500


> New Y[]: 
	
	 0  0  4  2  3  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 124 #######################


> Neighbours evaluated; 11
> Selected Move:	1720	4	3	5	17700


> New Y[]: 
	
	 0  0  4  1  3  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 125 #######################


> Neighbours evaluated; 11
> Selected Move:	1720	4	4	3	19300


> New Y[]: 
	
	 0  0  4  3  1  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 126 #######################


> Neighbours evaluated; 12
> Selected Move:	1720	4	3	5	19300


> New Y[]: 
	
	 0  0  4  2  1  3  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 127 #######################


> Neighbours evaluated; 11
> Selected Move:	1720	4	3	4	17500


> New Y[]: 
	
	 0  0  4  1  2  3  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 128 #######################


> Neighbours evaluated; 10
> Selected Move:	1800	3	4	8	17800


> New Y[]: 
	
	 0  0  4  1  0  3  1  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 129 #######################


> Neighbours evaluated; 9
> Selected Move:	1720	3	3	4	19300


> New Y[]: 
	
	 0  0  4  0  1  3  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,13

## ITERATION 130 #######################


> Neighbours evaluated; 14
> Selected Move:	1720	4	5	8	19400


> New Y[]: 
	
	 0  0  4  0  1  2  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,125

## ITERATION 131 #######################


> Neighbours evaluated; 13
> Selected Move:	1720	4	5	4	19400


> New Y[]: 
	
	 0  0  4  0  2  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,12

## ITERATION 132 #######################


> Neighbours evaluated; 13
> Selected Move:	1720	4	8	5	18500


> New Y[]: 
	
	 0  0  4  0  2  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,115

## ITERATION 133 #######################


> Neighbours evaluated; 13
> Selected Move:	1720	4	4	5	18700


> New Y[]: 
	
	 0  0  4  0  3  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,11

## ITERATION 134 #######################


> Neighbours evaluated; 13
> Selected Move:	1709	4	4	6	20100


> New Y[]: 
	
	 0  0  4  0  1  2  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,105

## ITERATION 135 #######################


> Neighbours evaluated; 16
> Selected Move:	1767	3	9	3	20600


> New Y[]: 
	
	 0  0  4  1  1  2  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0999999999999996

## ITERATION 136 #######################


> Neighbours evaluated; 11
> Selected Move:	1770	4	5	4	20600


> New Y[]: 
	
	 0  0  4  1  2  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0949999999999996

## ITERATION 137 #######################


> Neighbours evaluated; 14
> Selected Move:	1760	3	4	0	18600


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 138 #######################


> Neighbours evaluated; 25
> Selected Move:	1751	3	2	4	20100


> New Y[]: 
	
	 2  0  0  1  4  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 139 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	6	5	18500


> New Y[]: 
	
	 2  0  0  1  4  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 140 #######################


> Neighbours evaluated; 24
> Selected Move:	1760	4	4	5	19200


> New Y[]: 
	
	 2  0  0  1  3  4  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 141 #######################


> Neighbours evaluated; 22
> Selected Move:	1760	4	4	8	19900


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 142 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	5	4	19400


> New Y[]: 
	
	 2  0  0  1  4  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 143 #######################


> Neighbours evaluated; 22
> Selected Move:	1760	4	4	8	19500


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 144 #######################


> Neighbours evaluated; 21
> Selected Move:	1760	4	4	5	19300


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 145 #######################


> Neighbours evaluated; 21
> Selected Move:	1781	1	-1	9	23800


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0499999999999996

## ITERATION 146 #######################


> Neighbours evaluated; 21
> Selected Move:	1840	4	8	4	23000


> New Y[]: 
	
	 2  0  0  1  4  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0449999999999996

## ITERATION 147 #######################


> Neighbours evaluated; 20
> Selected Move:	1824	4	4	5	23700


> New Y[]: 
	
	 2  0  0  1  3  4  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0399999999999996

## ITERATION 148 #######################


> Neighbours evaluated; 21
> Selected Move:	1830	4	5	8	24000


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0349999999999996

## ITERATION 149 #######################


> Neighbours evaluated; 20
> Selected Move:	1854	4	4	8	23900


> New Y[]: 
	
	 2  0  0  1  4  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0399999999999996

## ITERATION 150 #######################


> Neighbours evaluated; 21
> Selected Move:	1814	4	4	5	24400


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0449999999999996

## ITERATION 151 #######################


> Neighbours evaluated; 14
> Selected Move:	1960	3	5	2	22900


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0499999999999996

## ITERATION 152 #######################


> Neighbours evaluated; 21
> Selected Move:	1925	1	-1	5	28900


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 153 #######################


> Neighbours evaluated; 19
> Selected Move:	1930	4	8	5	28000


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 154 #######################


> Neighbours evaluated; 18
> Selected Move:	1900	4	0	4	23500


> New Y[]: 
	
	 0  0  4  1  2  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0649999999999996

## ITERATION 155 #######################


> Neighbours evaluated; 16
> Selected Move:	1870	4	4	5	23700


> New Y[]: 
	
	 0  0  4  1  3  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0699999999999996

## ITERATION 156 #######################


> Neighbours evaluated; 15
> Selected Move:	1802	4	4	8	24400


> New Y[]: 
	
	 0  0  4  1  1  2  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0749999999999996

## ITERATION 157 #######################


> Neighbours evaluated; 13
> Selected Move:	1788	4	5	8	24300


> New Y[]: 
	
	 0  0  4  1  1  3  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0799999999999996

## ITERATION 158 #######################


> Neighbours evaluated; 14
> Selected Move:	1750	4	5	4	24500


> New Y[]: 
	
	 0  0  4  1  3  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0849999999999996

## ITERATION 159 #######################


> Neighbours evaluated; 10
> Selected Move:	1800	4	2	5	20000


> New Y[]: 
	
	 0  0  0  1  3  4  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 160 #######################


> Neighbours evaluated; 11
> Selected Move:	1710	4	8	3	21000


> New Y[]: 
	
	 0  0  0  2  3  4  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 161 #######################


> Neighbours evaluated; 13
> Selected Move:	1724	4	3	4	20800


> New Y[]: 
	
	 0  0  0  3  2  4  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 162 #######################


> Neighbours evaluated; 10
> Selected Move:	1740	4	3	6	20600


> New Y[]: 
	
	 0  0  0  1  2  4  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,105

## ITERATION 163 #######################


> Neighbours evaluated; 13
> Selected Move:	1706	4	5	8	20900


> New Y[]: 
	
	 0  0  0  1  2  1  3  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,11

## ITERATION 164 #######################


> Neighbours evaluated; 17
> Selected Move:	1720	3	8	2	19100


> New Y[]: 
	
	 0  0  4  1  2  1  3  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 165 #######################


> Neighbours evaluated; 10
> Selected Move:	1720	4	4	5	19100


> New Y[]: 
	
	 0  0  4  1  1  2  3  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 166 #######################


> Neighbours evaluated; 9
> Selected Move:	1720	4	5	6	19400


> New Y[]: 
	
	 0  0  4  1  1  3  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 167 #######################


> Neighbours evaluated; 9
> Selected Move:	1793	3	5	8	20300


> New Y[]: 
	
	 0  0  4  1  1  0  2  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,13

## ITERATION 168 #######################


> Neighbours evaluated; 12
> Selected Move:	1700	3	6	0	18400


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 169 #######################


> Neighbours evaluated; 23
> Selected Move:	1710	3	4	6	16400


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 170 #######################


> Neighbours evaluated; 19
> Selected Move:	1710	4	8	3	17300


> New Y[]: 
	
	 2  0  4  3  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 171 #######################


> Neighbours evaluated; 21
> Selected Move:	1710	4	3	6	17100


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 172 #######################


> Neighbours evaluated; 21
> Selected Move:	1710	4	6	9	17400


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 173 #######################


> Neighbours evaluated; 18
> Selected Move:	1710	3	2	4	18900


> New Y[]: 
	
	 2  0  0  1  4  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,12

## ITERATION 174 #######################


> Neighbours evaluated; 21
> Selected Move:	1710	4	4	8	19700


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  4  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,115

## ITERATION 175 #######################


> Neighbours evaluated; 18
> Selected Move:	1710	4	9	3	19600


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,11

## ITERATION 176 #######################


> Neighbours evaluated; 20
> Selected Move:	1710	4	3	4	18000


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,105

## ITERATION 177 #######################


> Neighbours evaluated; 18
> Selected Move:	1710	4	4	6	19400


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 178 #######################


> Neighbours evaluated; 20
> Selected Move:	1710	4	8	4	18600


> New Y[]: 
	
	 2  0  0  1  4  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 179 #######################


> Neighbours evaluated; 21
> Selected Move:	1710	4	4	6	19400


> New Y[]: 
	
	 2  0  0  1  3  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 180 #######################


> Neighbours evaluated; 22
> Selected Move:	1719	3	0	5	20900


> New Y[]: 
	
	 0  0  0  1  3  2  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 181 #######################


> Neighbours evaluated; 13
> Selected Move:	1724	4	6	3	20900


> New Y[]: 
	
	 0  0  0  4  3  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 182 #######################


> Neighbours evaluated; 10
> Selected Move:	1744	4	4	5	20700


> New Y[]: 
	
	 0  0  0  4  2  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 183 #######################


> Neighbours evaluated; 10
> Selected Move:	1725	4	3	9	21000


> New Y[]: 
	
	 0  0  0  1  2  3  1  0  1  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 184 #######################


> Neighbours evaluated; 15
> Selected Move:	1737	4	4	9	20900


> New Y[]: 
	
	 0  0  0  1  4  3  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 185 #######################


> Neighbours evaluated; 12
> Selected Move:	1680	4	4	5	21600


> New Y[]: 
	
	 0  0  0  1  3  4  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 186 #######################


> Neighbours evaluated; 12
> Selected Move:	1728	4	4	9	20900


> New Y[]: 
	
	 0  0  0  1  2  4  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 187 #######################


> Neighbours evaluated; 10
> Selected Move:	1698	4	5	8	21200


> New Y[]: 
	
	 0  0  0  1  2  1  1  0  4  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 188 #######################


> Neighbours evaluated; 16
> Selected Move:	1701	4	9	3	21100


> New Y[]: 
	
	 0  0  0  3  2  1  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 189 #######################


> Neighbours evaluated; 14
> Selected Move:	1740	3	3	1	18800


> New Y[]: 
	
	 0  3  0  0  2  1  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 190 #######################


> Neighbours evaluated; 16
> Selected Move:	1740	4	4	5	18800


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,105

## ITERATION 191 #######################


> Neighbours evaluated; 17
> Selected Move:	1740	4	5	8	19300


> New Y[]: 
	
	 0  3  0  0  1  4  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,11

## ITERATION 192 #######################


> Neighbours evaluated; 15
> Selected Move:	1760	3	8	0	17000


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 193 #######################


> Neighbours evaluated; 26
> Selected Move:	1770	3	5	2	15500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 194 #######################


> Neighbours evaluated; 31
> Selected Move:	1770	3	9	5	17000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 195 #######################


> Neighbours evaluated; 32
> Selected Move:	1770	3	0	8	19300


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,11

## ITERATION 196 #######################


> Neighbours evaluated; 8
> Selected Move:	1770	4	8	4	18500


> New Y[]: 
	
	 0  3  4  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,105

## ITERATION 197 #######################


> Neighbours evaluated; 11
> Selected Move:	1770	4	4	5	18500


> New Y[]: 
	
	 0  3  4  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0999999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 12
> Selected Move:	1750	3	1	3	20800


> New Y[]: 
	
	 0  0  4  3  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0949999999999996

## ITERATION 199 #######################


> Neighbours evaluated; 10
> Selected Move:	1754	4	3	5	20800


> New Y[]: 
	
	 0  0  4  2  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,0899999999999996

## ITERATION 200 #######################


> Neighbours evaluated; 11
> Selected Move:	1750	3	3	0	18500


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,0849999999999996

## ITERATION 201 #######################


> Neighbours evaluated; 21
> Selected Move:	1750	4	5	4	18700


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,0799999999999996

## ITERATION 202 #######################


> Neighbours evaluated; 21
> Selected Move:	1844	1	-1	3	23700


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 203 #######################


> Neighbours evaluated; 19
> Selected Move:	1810	4	4	8	24400


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 204 #######################


> Neighbours evaluated; 17
> Selected Move:	1837	3	8	9	23900


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 205 #######################


> Neighbours evaluated; 14
> Selected Move:	1840	4	9	6	23600


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 206 #######################


> Neighbours evaluated; 18
> Selected Move:	1806	4	6	3	23800


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 207 #######################


> Neighbours evaluated; 18
> Selected Move:	1767	3	5	8	23800


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 208 #######################


> Neighbours evaluated; 16
> Selected Move:	1766	4	3	6	23600


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 209 #######################


> Neighbours evaluated; 15
> Selected Move:	1800	3	6	1	22000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,0999999999999996
________________________________________________________________

Best solution found: 1860
Run Termination time: 03.02.2010 20:15:30
Run duration: 00:00:20.6406250
________________________________________________________________
